Partial Hamming graphs and expansion procedures
نویسنده
چکیده
Structural properties of isometric subgraphs of Hamming graphs are presented, generalizing certain results on quasi-median graphs. Consequently, a relation on the edge set of a graph which is closely related to Winkler–Djokovi6 c’s relation is introduced and used for a characterization of isometric subgraphs of Hamming graphs. Moreover, some results considering semi-median graphs and expansions on isometric subgraphs of hypercubes are extended to general non-bipartite case. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Quasi-median graphs, their generalizations, and tree-like equalities
Three characterizations of quasi-median graphs are proved, for instance, they are partial Hamming graphs without convex house and convexQ 3 such that certain relations on their edge sets coincide. Expansion procedures, weakly 2-convexity, and several relations on the edge set of a graph are essential for these results. Quasisemimedian graphs are characterized which yields an additional characte...
متن کاملTree-like partial Hamming graphs
Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227–240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and ...
متن کاملHamming polynomials and their partial derivatives
Hamming graphs are Cartesian products of complete graphs and partial Hamming graphs are their isometric subgraphs. The Hamming polynomial h(G) of a graph G is introduced as the Hamming subgraphs counting polynomial. Kk-derivates ∂kG (k ≥ 2) of a partial Hamming graph are also introduced. It is proved that for a partial Hamming graph G, ∂h(G) ∂xk = h(∂kG). A couple of combinatorial identities in...
متن کاملOn the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs
This paper contains a new algorithm that recognizes whether a given graph G is a Hamming graph , i . e . a Cartesian product of complete graphs , in O ( m ) time and O ( n 2 ) space . Here m and n denote the numbers of edges and vertices of G , respectively . Previously this was only possible in O ( m log n ) time . Moreover , we present a survey of other recognition algorithms for Hamming grap...
متن کاملOn the canonical metric representation of graphs and partial Hamming graphs
Average distance of a graph is bounded in terms of its canonical metric representation. The inequality in particular yields a characterization of isometric subgraphs of Hamming graphs which in turn simplifies recognition of these graphs and computation of average distance.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 237 شماره
صفحات -
تاریخ انتشار 2001